1
کامپیوتر و شبکه::
ضرب ایمن ماتریس توزیع یافته
On the Capacity of Secure Distributed Matrix Multiplication
The problem of secure distributed matrix multiplication (SDMM) studies the communication efficiency of retrieving a sequence of desired L×M matrix products AB = (A1B1, A2B2, · · · , AS BS ) from N distributed servers where the constituent L × K matrices A = (A1, A2, · · · , AS ) and
The rate of an SDMM scheme is defined as the ratio of the number of bits of desired information that is retrieved, to the total number of bits downloaded on average.
The supremum of achievable rates is called the capacity of SDMM.
In this work we explore the capacity of SDMM, as well as several of its variants, e.g.
واژگان شبکه مترجمین ایران